Wrapping Ellipses Around a Convex Skeleton
نویسندگان
چکیده
Let F and G denote two closed convex curves in the (X, Z)-plane and in the (Y, Z)-plane, correspondingly, that are symmetric about the Z-axis and cross at two points. Let S denote the solid that results from wrapping (X, Y )parallel ellipses around F and G. Surprisingly, S need not be convex (though all intersections with planes containing the Z-axis are!). We analyze under which condition the solid S is convex, and provide one necessary and one sufficient criterion that are easy to use in practice.
منابع مشابه
Linear Time Varying MPC Based Path Planning of an Autonomous Vehicle via Convex Optimization
In this paper a new method is introduced for path planning of an autonomous vehicle. In this method, the environment is considered cluttered and with some uncertainty sources. Thus, the state of detected object should be estimated using an optimal filter. To do so, the state distribution is assumed Gaussian. Thus the state vector is estimated by a Kalman filter at each time step. The estimation...
متن کاملComputing bitangents for ellipses
We show how to compute the bitangents of two ellipses, and how to evaluate the predicates required to compute objects like convex hulls or visibility complexes for ellipses. Also, we show how to compute the tangency points of the bitangents.
متن کاملPatient-specific fibre-based models of muscle wrapping.
In many biomechanical problems, the availability of a suitable model for the wrapping of muscles when undergoing movement is essential for the estimation of forces produced on and by the body during motion. This is an important factor in the Osteoporotic Virtual Physiological Human project which is investigating the likelihood of fracture for osteoporotic patients undertaking a variety of movem...
متن کاملFully Bounded Polyhedral Analysis of Integers with Wrapping
Analysis of convex polyhedra using abstract interpretation is a common and powerful program analysis technique to discover linear relationships among variables in a program. However, the classical way of performing polyhedral analysis does not model the fact that values typically are stored as fixed-size binary strings and usually have a wrap-around semantics in the case of overflows. In embedd...
متن کاملA novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane
In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection of the ellipses are found in an efficient manner. To do so, the intersection points of the ellipses that fall on the boundary of the intersection region are d...
متن کامل